Sure Success Partial Search
نویسندگان
چکیده
Partial search has been proposed recently for finding the target block containing a target element with fewer queries than the full Grover search algorithm which can locate the target precisely. Since such partial searches will likely be used as subroutines for larger algorithms their success rate is important. We propose a partial search algorithm which achieves success with unit probability.
منابع مشابه
nt - p h / 06 03 13 6 v 1 15 M ar 2 00 6 Sure success partial search
In 1985 Deutsch designed a quantum algorithm which evaluates whether the two outputs of a Boolean function are the same or not using only one function evaluation [1]. Deutsch and Jozsa generalized this algorithm for a more general case such as whether a given Boolean function is constant or balanced. This algorithm demonstrated an exponential speed-up on a quantum machine compared to the best p...
متن کاملLocal adiabatic quantum search with different paths
We report on a detailed analysis of generalization of the local adiabatic search algorithm. Instead of evolving directly from an initial ground state Hamiltonian to a solution Hamiltonian a different evolution path via a ’sure success’ Hamiltonian is introduced and is shown that the time required to find an item in a database of size N can be made to be almost independent of the size of the dat...
متن کاملQuantum algorithm to distinguish Boolean functions of different weights
By the weight of a Boolean function f , denoted by wt(f), we mean the number of inputs for which f outputs 1. Given a promise that an n-variable Boolean function (available in the form of a black box and the output is available in constant time once the input is supplied) is of weight either wN or (1−w)N (0 < w < 1, N = 2), we present a detailed study of quantum algorithms to find out which one...
متن کاملThe tip-of-the-tongue phenomenon: search strategy and resolution during word finding difficulties
A tip-of-the-tongue (TOT) experience refers to the state in which a speaker is temporally unable to retrieve a word from memory, while being sure that he knows the word. The recovered partial information can consist of competing items that resemble the target word phonologically or semantically and could give rise to competition or conflict during attempts to resolve the TOT. A question that ha...
متن کاملAlmost Sure Functional Limit Theorem for the Product of Partial Sums
We prove an almost sure functional limit theorem for the product of partial sums of i.i.d. positive random variables with finite second moment. Mathematics Subject Classification. 60F05, 60F15. Received March 25, 2008. Revised August 10, 2008.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Quantum Information Processing
دوره 6 شماره
صفحات -
تاریخ انتشار 2007